skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "English, Sean"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Journal of Graph Theory)
    Abstract In the Constructor–Blocker game, two players, Constructor and Blocker, alternately claim unclaimed edges of the complete graph . For given graphs and , Constructor can only claim edges that leave her graph ‐free, while Blocker has no restrictions. Constructor's goal is to build as many copies of as she can, while Blocker attempts to minimize the number of copies of in Constructor's graph. The game ends once there are no more edges that Constructor can claim. The score of the game is the number of copies of in Constructor's graph at the end of the game when both players play optimally and Constructor plays first. In this paper, we extend results of Patkós, Stojaković and Vizer on to many pairs of and : We determine when and , also when both and are odd cycles, using Szemerédi's Regularity Lemma. We also obtain bounds of when and . 
    more » « less
    Free, publicly-accessible full text available March 1, 2026
  2. ; ; ; (, European Journal of Combinatorics)
    Full Text Available 
  3. ; ; (, Discrete Mathematics)
    Full Text Available 
  4. ; ; ; (, Journal of Graph Theory)